A loop conjecture for metabolic closure

نویسندگان

  • Diego Contreras
  • Ulises Pereira
  • Valentina C. Hernandez
  • Bryan Reynaert
  • Juan-Carlos Letelier
چکیده

Although in the last few decades a variety of theoretical tools have been developed to better understand living organisms, their impact on experimental research has been rather limited. A common element between these theories is the idea of metabolic closure, i.e., the systems that produce all their metabolites and catalysts. In spite of an increasing consensus on the relevance of closure, a formal and operative definition has remained elusive. In this paper we revisit RAF sets and chemical organization theory and show how these two theories overlap and could help bring forth real world results. We also state a theorem ensuring the presence of a cycle of interdependent catalysts for RAF sets and conjecture that these cycles give stability to the network. This conjecture is illustrated and supported by computer simulations. Unavoidably, our viewpoint introduces the notion of fluxes and thus a temporal dimension to the purely algebraic model of RAF sets. The results of this work show that the incorporation of closure, topological and dynamical tools altogether is a promising path for a deeper understanding of living systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AN EASY SOLUTION FOR THE DIVERTING LOOP COLOSTOMY: OUR TECHNIQUE

 ABSTRACT Background: The loop colostomy is one of the most popular techniques used as a protective maneuver for a distal anastomosis and/or temporary fecal diversion. We are introducing the use of a full thickness skin bridge under the large bowel instead of a glass rod which alleviates problems such as protrusion of the large bowel, retraction of the bowel into the abdomen after removing the ...

متن کامل

Frankl's Conjecture for a subclass of semimodular lattices

 In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...

متن کامل

The Auslander-Reiten Conjecture for Group Rings

This paper studies the vanishing of $Ext$ modules over group rings. Let $R$ be a commutative noetherian ring and $ga$ a group. We provide a criterion under which the vanishing of self extensions of a finitely generated $Rga$-module $M$ forces it to be projective. Using this result, it is shown that $Rga$ satisfies the Auslander-Reiten conjecture, whenever $R$ has finite global dimension and $ga...

متن کامل

A bound for Feichtinger conjecture

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...

متن کامل

-λ coloring of graphs and Conjecture Δ ^ 2

For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011